#include <bits/stdc++.h>
using namespace std ;
const int N=1e6+10;
int r[N],l[N],t[N];
int main(){
    freopen("duel.in","r",stdin);
    freopen("duel.out","w",stdout);
    int n;
    cin>>n;
    for(int i=1;i<=n;i++){
        scanf("%d",&r[i]);
    }
    sort(r+1,r+n+1);
    int f1=0;
    int p=1;
    int p2=1;
    while(p && p2){
        p=0;
        p2=0;
        for(int i=1;i<=n;i++){
            if(l[i]==0){
                f1=i;
                break;
            }
        }
        for(int i=1;i<=n;i++){
            if(r[i]>r[f1] && t[i]==0){
                l[f1]++;
                t[i]++;
                p2++;
                break;
            }
        }
        for(int k=1;k<=n;k++){
            if(l[k]==0 && t[k]==0) p++;
        }
    }
    int ans=0;
    for(int i=1;i<=n;i++){
        if(l[i]==0) ans++;
    }
    cout<<ans;
    return 0;
}
